A Formal Definition of Hierarchical Predicate Transition Nets
نویسنده
چکیده
Hierarchical predicate transition nets have recently been introduced as a visual formalism for specifying complex reactive systems. They extend predicate transition nets with hierarchical structures so that large systems can be specified and understood stepwisely, and thus are more suitable for real-world applications. In this paper, we provide a formal syntax and an algebraic semantics for hierarchical predicate transition nets, which establish the theory of hierarchical predicate transition nets for precise specification and formal reasoning.
منابع مشابه
A Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملIntegrating UML Statechart and Collaboration Diagrams Using Hierarchical Predicate Transition Nets
UML has become the standard object-oriented analysis and design language in software industry. However UML lacks a precise semantics that hinders error detection in the early stages of system development. Even worse, there is no clear definition of consistency criteria among various UML notations, and there are few examples of illustrating the use of various notations together. In this paper, w...
متن کاملFormal Modeling and Verification of Dynamic Reconfiguration of Autonomous Robotics Systems
Dynamic reconfiguration refers to the ability of a system to dynamically change its structure and interface according to different situations. It provides feasible and flexible modeling and simulation environments with powerful modeling capability and the extra flexibility to design and analyze robotics systems. The aim of this work is the modeling and verification of autonomous robotics system...
متن کامل7kh 3$5$',6( 'hvljq (qylurqphqw
State Machines formerly called Evolving Algebras [Gur95] combine declarative concepts of first-order logic with the abstract operational view of transition systems in a unifying framework for mathematical modeling of discrete dynamic systems. The underlying computation model constitutes a simple yet powerful semantic basis to deal with concurrent and reactive behavior in a direct and intuitive ...
متن کامل